Strengthening topological colorful results for graphs
نویسندگان
چکیده
منابع مشابه
Colorful paths for 3-chromatic graphs
In this paper, we prove that every 3-chromatic connected graph, except C7, admits a 3-vertex coloring in which every vertex is the beginning of a 3-chromatic path. It is a special case of a conjecture due to S. Akbari, F. Khaghanpoor, and S. Moazzeni, cited in [P.J. Cameron, Research problems from the BCC22, Discrete Math. 311 (2011), 1074–1083], stating that every connected graph G other than ...
متن کاملColored graphs without colorful cycles
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that a colored graph lacks colorful cycles iff it is Gallai, i.e., lacks colorful triangles. We then show that, under the operation m◦n ≡ m+n−2, the omitted lengths of colorful cycles in a colored graph form a monoid isomorp...
متن کاملTopological De-Noising: Strengthening the Topological Signal
Topological methods, including persistent homology, are powerful tools for analysis of high-dimensional data sets but these methods rely almost exclusively on thresholding techniques. In noisy data sets, thresholding does not always allow for the recovery of topological information. We present an easy to implement, computationally efficient pre-processing algorithm to prepare noisy point cloud ...
متن کاملStrengthening Hardness Results to 3-Connected Planar Graphs
In this paper we extend some classical NP-hardness results from the class of 2-connected planar graphs to subclasses of 3-connected planar graphs. The reduction are partly based on a new graph augmentation, which may be of independent interest.
متن کاملColorful Paths in Vertex Coloring of Graphs
A colorful path in a graph G is a path with χ(G) vertices whose colors are different. A vcolorful path is such a path, starting from v. Let G 6= C7 be a connected graph with maximum degree ∆(G). We show that there exists a (∆(G) + 1)-coloring of G with a v-colorful path for every v ∈ V (G). We also prove that this result is true if one replaces (∆(G) + 1) colors with 2χ(G) colors. If χ(G) = ω(G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2017
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2017.03.011